Mine fleet cost evaluation - Dijkstra's optimized path
نویسندگان
چکیده
منابع مشابه
Path Planning for Mine Countermeasures
We have developed path-planning techniques and tools to look for paths through minefields. Our techniques seek to balance the length and risk associated with different routes through a minefield. Our methods are intended to provide battlegroup commanders powerful new tools to evaluate alternative routes while searching for low risk paths. It is well known how to find the path of shortest distan...
متن کاملOptimal Earthmoving Fleet Size for Minimising Emissions and Cost
Traditionally, the earthmoving operations have been developed based on the minimum cost per production criterion. Nowadays, due to the negative impacts of the emissions on the environment, there is an increasing public awareness to reduce the emissions from the earthmoving operations. Different management strategies can be employed to reduce emissions, amongst other things, which can also resul...
متن کاملConstrained Path Optimisation for Underground Mine Layout
The major infrastructure component required to develop an underground mine is a decline, which is a system of tunnels used for access and haulage. In this paper we study the problem of designing a decline of minimum cost where cost is a combination of development and haulage costs over the life of the mine. A key design consideration is that the decline must be navigable to trucks and mining eq...
متن کاملOn The Optimization of Dijkstras Algorithm
In this paper, we propose some amendment on Dijkstra’s algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra’s algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra’s algorithm is less than the ...
متن کاملAn Optimized Hybrid Approach for Path Finding
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike most path finding algorithms which require destination co-ordinates to compute path, the proposed algorithm comprises of a new method which finds path using backtracking without requiring ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: REM - International Engineering Journal
سال: 2019
ISSN: 2448-167X
DOI: 10.1590/0370-44672018720124